On Some Computability Notions for Real Functions
نویسندگان
چکیده
منابع مشابه
On Some Computability Notions for Real Functions
A widely used approach to computability of real functions is the one in Grzegorczyk’s style originating from [1]. This approach uses computable transformations of infinitistic names of real numbers, as well as general quantifiers over these names. Other approaches allow avoiding the use of such names at least in some cases. An approach of this other kind is, for instance, the one of Tent and Zi...
متن کاملOn a Relative Computability Notion for Real Functions
▸ For any class F of total functions in N, we define what it means for a real function to be conditionally F-computable. This notion extends the notion of uniform F-computability of real functions introduced in the paper [SkWeGe10]. ▸ If F consists of recursive functions then the conditionally F-computable real functions are computable in the sense of [Gr 55] extended by allowing the used compu...
متن کاملNotions of Probabilistic Computability on Represented Spaces
We define and compare several probabilistic notions of computability for mappings from represented spaces (that are equipped with a measure or outer measure) into computable metric spaces. We thereby generalize definitions by [Ko 1991] and Parker (see [Parker 2003, Parker 2005, Parker 2006]), and furthermore introduce the new notion of computability in the mean. Some results employ a notion of ...
متن کاملOn the Weak Computability of Continuous Real Functions
In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (ρ-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there is a Turing machine M which computes f in the sense that, M accepts any ρ-name of x as input and outputs a ρ-name of f (x) for any x in the domain of f . By wea...
متن کاملNotions of computability at higher types III
Examples 1.2 (i) Let 1 be the singleton type world {⋆}, with ⋆ → ⋆ = ⋆×⋆ = ⋆). (ii) Let F (γ1, . . . , γr) be the set of finite or simple types, freely generated via × and → from the basic type names γ1, . . . , γr. Important examples are F (ι) and F (ι, o), where ι and o are thought of as the types of natural numbers and booleans respectively. (iii) Richer languages of types, for example as in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computability
سال: 2013
ISSN: 2211-3568
DOI: 10.3233/com-13018